Minimal signatures of naturalness

Supersymmetry, Naturalness, and Signatures at the LHC

Weak scale supersymmetry is often said to be fine-tuned, especially if the matter content is minimal. This is not true if there is a large A term for the top squarks. We present a systematic study on fine-tuning in minimal supersymmetric theories and identify low energy spectra that do not lead to severe fine-tuning. Characteristic features of these spectra are: a large A term for the top squar...

Naturalness Reach of the Large Hadron Collider in Minimal Supergravity

We re-analyse the prospects of discovering supersymmetry at the LHC, in order to re-express coverage in terms of a fine-tuning parameter and to extend the analysis to scalar masses (m0) above 2 TeV. We use minimal supergravity (mSUGRA) unification assumptions for the SUSY breaking parameters. Such high values of m0 have recently been found to have a focus point, leading to relatively low fine-t...

Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs

We construct a pairing-based simulation-extractable succinct non-interactive argument of knowledge (SE-SNARK) that consists of only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to signatures of knowledge, we then obtain a succinct signature of knowledge consisting of only 3 group elements. SE-SNARKs enable a prover to give a proof that they know a witnes...

Digital Signatures with Minimal Overhead

In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and the overhead |τ | − |m|. A simple argument shows that for any scheme with “n bi...

On Minimal Logarithmic Signatures of Finite Groups